ua_types.c 42 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267
  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_ALLOCPRINTF_BUFSIZE 1024
  101. UA_StatusCode UA_String_copyprintf(char const fmt[], UA_String *dst, ...) {
  102. char src[UA_STRING_ALLOCPRINTF_BUFSIZE];
  103. va_list ap;
  104. va_start(ap, dst);
  105. #if ((__GNUC__ == 4 && __GNUC_MINOR__ >= 6) || __GNUC__ > 4 || 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_ALLOCPRINTF_BUFSIZE, fmt, ap);
  111. #if ((__GNUC__ == 4 && __GNUC_MINOR__ >= 6) || __GNUC__ > 4 || 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_ALLOCPRINTF_BUFSIZE ? UA_STRING_ALLOCPRINTF_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 = memcmp((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. void UA_NodeId_deleteMembers(UA_NodeId *p) {
  287. switch(p->identifierType) {
  288. case UA_NODEIDTYPE_STRING:
  289. case UA_NODEIDTYPE_BYTESTRING:
  290. UA_ByteString_deleteMembers(&p->identifier.byteString);
  291. break;
  292. default:
  293. break;
  294. }
  295. }
  296. UA_Boolean UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2) {
  297. if(n1->namespaceIndex != n2->namespaceIndex || n1->identifierType!=n2->identifierType)
  298. return UA_FALSE;
  299. switch(n1->identifierType) {
  300. case UA_NODEIDTYPE_NUMERIC:
  301. if(n1->identifier.numeric == n2->identifier.numeric)
  302. return UA_TRUE;
  303. else
  304. return UA_FALSE;
  305. case UA_NODEIDTYPE_STRING:
  306. return UA_String_equal(&n1->identifier.string, &n2->identifier.string);
  307. case UA_NODEIDTYPE_GUID:
  308. return UA_Guid_equal(&n1->identifier.guid, &n2->identifier.guid);
  309. case UA_NODEIDTYPE_BYTESTRING:
  310. return UA_ByteString_equal(&n1->identifier.byteString, &n2->identifier.byteString);
  311. }
  312. return UA_FALSE;
  313. }
  314. UA_Boolean UA_NodeId_isNull(const UA_NodeId *p) {
  315. switch(p->identifierType) {
  316. case UA_NODEIDTYPE_NUMERIC:
  317. if(p->namespaceIndex != 0 || p->identifier.numeric != 0)
  318. return UA_FALSE;
  319. break;
  320. case UA_NODEIDTYPE_STRING:
  321. if(p->namespaceIndex != 0 || p->identifier.string.length > 0)
  322. return UA_FALSE;
  323. break;
  324. case UA_NODEIDTYPE_GUID:
  325. if(p->namespaceIndex != 0 ||
  326. memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]) { 0 }, sizeof(UA_Guid)) != 0)
  327. return UA_FALSE;
  328. break;
  329. case UA_NODEIDTYPE_BYTESTRING:
  330. if(p->namespaceIndex != 0 || p->identifier.byteString.length > 0)
  331. return UA_FALSE;
  332. break;
  333. default:
  334. return UA_FALSE;
  335. }
  336. return UA_TRUE;
  337. }
  338. UA_NodeId UA_NodeId_fromInteger(UA_UInt16 nsIndex, UA_Int32 identifier) {
  339. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_NUMERIC,
  340. .identifier.numeric = identifier };
  341. }
  342. UA_NodeId UA_NodeId_fromCharString(UA_UInt16 nsIndex, char identifier[]) {
  343. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  344. .identifier.string = UA_STRING(identifier) };
  345. }
  346. UA_NodeId UA_NodeId_fromCharStringCopy(UA_UInt16 nsIndex, char const identifier[]) {
  347. return (UA_NodeId) {.namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  348. .identifier.string = UA_STRING_ALLOC(identifier) };
  349. }
  350. UA_NodeId UA_NodeId_fromString(UA_UInt16 nsIndex, UA_String identifier) {
  351. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_STRING,
  352. .identifier.string = identifier };
  353. }
  354. UA_NodeId UA_NodeId_fromStringCopy(UA_UInt16 nsIndex, UA_String identifier) {
  355. UA_NodeId id;
  356. id.namespaceIndex = nsIndex;
  357. id.identifierType = UA_NODEIDTYPE_STRING;
  358. UA_String_copy(&identifier, &id.identifier.string);
  359. return id;
  360. }
  361. UA_NodeId UA_NodeId_fromGuid(UA_UInt16 nsIndex, UA_Guid identifier) {
  362. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_GUID,
  363. .identifier.guid = identifier };
  364. }
  365. UA_NodeId UA_NodeId_fromCharByteString(UA_UInt16 nsIndex, char identifier[]) {
  366. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  367. .identifier.byteString = UA_STRING(identifier) };
  368. }
  369. UA_NodeId UA_NodeId_fromCharByteStringCopy(UA_UInt16 nsIndex, char const identifier[]) {
  370. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  371. .identifier.byteString = UA_STRING_ALLOC(identifier) };
  372. }
  373. UA_NodeId UA_NodeId_fromByteString(UA_UInt16 nsIndex, UA_ByteString identifier) {
  374. return (UA_NodeId) { .namespaceIndex = nsIndex, .identifierType = UA_NODEIDTYPE_BYTESTRING,
  375. .identifier.byteString = identifier };
  376. }
  377. UA_NodeId UA_NodeId_fromByteStringCopy(UA_UInt16 nsIndex, UA_ByteString identifier) {
  378. UA_NodeId id;
  379. id.namespaceIndex = nsIndex;
  380. id.identifierType = UA_NODEIDTYPE_BYTESTRING;
  381. UA_ByteString_copy(&identifier, &id.identifier.byteString);
  382. return id;
  383. }
  384. /* ExpandedNodeId */
  385. UA_TYPE_NEW_DEFAULT(UA_ExpandedNodeId)
  386. UA_TYPE_DELETE_DEFAULT(UA_ExpandedNodeId)
  387. void UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId *p) {
  388. UA_NodeId_deleteMembers(&p->nodeId);
  389. UA_String_deleteMembers(&p->namespaceUri);
  390. }
  391. void UA_ExpandedNodeId_init(UA_ExpandedNodeId *p) {
  392. UA_NodeId_init(&p->nodeId);
  393. UA_String_init(&p->namespaceUri);
  394. p->serverIndex = 0;
  395. }
  396. UA_StatusCode UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  397. UA_StatusCode retval = UA_NodeId_copy(&src->nodeId, &dst->nodeId);
  398. retval |= UA_String_copy(&src->namespaceUri, &dst->namespaceUri);
  399. dst->serverIndex = src->serverIndex;
  400. if(retval) {
  401. UA_ExpandedNodeId_deleteMembers(dst);
  402. UA_ExpandedNodeId_init(dst);
  403. }
  404. return retval;
  405. }
  406. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId *p) {
  407. return UA_NodeId_isNull(&p->nodeId);
  408. }
  409. /* StatusCode */
  410. /* QualifiedName */
  411. UA_TYPE_NEW_DEFAULT(UA_QualifiedName)
  412. UA_TYPE_DELETE_DEFAULT(UA_QualifiedName)
  413. void UA_QualifiedName_deleteMembers(UA_QualifiedName *p) {
  414. UA_String_deleteMembers(&p->name);
  415. }
  416. void UA_QualifiedName_init(UA_QualifiedName *p) {
  417. UA_String_init(&p->name);
  418. p->namespaceIndex = 0;
  419. }
  420. UA_StatusCode UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  421. UA_StatusCode retval = UA_String_copy(&src->name, &dst->name);
  422. dst->namespaceIndex = src->namespaceIndex;
  423. if(retval) {
  424. UA_QualifiedName_deleteMembers(dst);
  425. UA_QualifiedName_init(dst);
  426. }
  427. return retval;
  428. }
  429. /* LocalizedText */
  430. UA_TYPE_NEW_DEFAULT(UA_LocalizedText)
  431. UA_TYPE_DELETE_DEFAULT(UA_LocalizedText)
  432. void UA_LocalizedText_deleteMembers(UA_LocalizedText *p) {
  433. UA_String_deleteMembers(&p->locale);
  434. UA_String_deleteMembers(&p->text);
  435. }
  436. void UA_LocalizedText_init(UA_LocalizedText *p) {
  437. UA_String_init(&p->locale);
  438. UA_String_init(&p->text);
  439. }
  440. UA_StatusCode UA_LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText *dst) {
  441. UA_StatusCode retval = UA_String_copy(&src->locale, &dst->locale);
  442. retval |= UA_String_copy(&src->text, &dst->text);
  443. if(retval) {
  444. UA_LocalizedText_deleteMembers(dst);
  445. UA_LocalizedText_init(dst);
  446. }
  447. return retval;
  448. }
  449. /* ExtensionObject */
  450. UA_TYPE_NEW_DEFAULT(UA_ExtensionObject)
  451. UA_TYPE_DELETE_DEFAULT(UA_ExtensionObject)
  452. void UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  453. UA_NodeId_deleteMembers(&p->typeId);
  454. UA_ByteString_deleteMembers(&p->body);
  455. }
  456. void UA_ExtensionObject_init(UA_ExtensionObject *p) {
  457. UA_NodeId_init(&p->typeId);
  458. p->encoding = UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED;
  459. UA_ByteString_init(&p->body);
  460. }
  461. UA_StatusCode UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  462. UA_StatusCode retval = UA_ByteString_copy(&src->body, &dst->body);
  463. retval |= UA_NodeId_copy(&src->typeId, &dst->typeId);
  464. dst->encoding = src->encoding;
  465. if(retval) {
  466. UA_ExtensionObject_deleteMembers(dst);
  467. UA_ExtensionObject_init(dst);
  468. }
  469. return retval;
  470. }
  471. /* DataValue */
  472. UA_TYPE_NEW_DEFAULT(UA_DataValue)
  473. UA_TYPE_DELETE_DEFAULT(UA_DataValue)
  474. void UA_DataValue_deleteMembers(UA_DataValue *p) {
  475. UA_Variant_deleteMembers(&p->value);
  476. }
  477. void UA_DataValue_init(UA_DataValue *p) {
  478. *((UA_Byte*)p) = 0; // zero out the bitfield
  479. p->serverPicoseconds = 0;
  480. UA_DateTime_init(&p->serverTimestamp);
  481. p->sourcePicoseconds = 0;
  482. UA_DateTime_init(&p->sourceTimestamp);
  483. UA_StatusCode_init(&p->status);
  484. UA_Variant_init(&p->value);
  485. }
  486. UA_StatusCode UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst) {
  487. UA_DataValue_init(dst);
  488. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  489. UA_StatusCode retval = UA_DateTime_copy(&src->serverTimestamp, &dst->serverTimestamp);
  490. retval |= UA_DateTime_copy(&src->sourceTimestamp, &dst->sourceTimestamp);
  491. retval |= UA_Variant_copy(&src->value, &dst->value);
  492. dst->serverPicoseconds = src->serverPicoseconds;
  493. dst->sourcePicoseconds = src->sourcePicoseconds;
  494. dst->status = src->status;
  495. if(retval) {
  496. UA_DataValue_deleteMembers(dst);
  497. UA_DataValue_init(dst);
  498. }
  499. return retval;
  500. }
  501. /* Variant */
  502. UA_TYPE_NEW_DEFAULT(UA_Variant)
  503. UA_TYPE_DELETE_DEFAULT(UA_Variant)
  504. void UA_Variant_init(UA_Variant *p) {
  505. p->storageType = UA_VARIANT_DATA;
  506. p->arrayLength = -1;
  507. p->data = UA_NULL;
  508. p->arrayDimensions = UA_NULL;
  509. p->arrayDimensionsSize = -1;
  510. p->type = &UA_TYPES[UA_TYPES_BOOLEAN];
  511. }
  512. void UA_Variant_deleteMembers(UA_Variant *p) {
  513. if(p->storageType != UA_VARIANT_DATA)
  514. return;
  515. if(p->data) {
  516. if(p->arrayLength == -1)
  517. p->arrayLength = 1;
  518. UA_Array_delete(p->data, p->type, p->arrayLength);
  519. p->data = UA_NULL;
  520. p->arrayLength = -1;
  521. }
  522. if(p->arrayDimensions) {
  523. UA_free(p->arrayDimensions);
  524. p->arrayDimensions = UA_NULL;
  525. p->arrayDimensionsSize = -1;
  526. }
  527. }
  528. UA_StatusCode UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  529. UA_Variant_init(dst);
  530. UA_Int32 elements = src->arrayLength;
  531. if(UA_Variant_isScalar(src))
  532. elements = 1;
  533. UA_StatusCode retval = UA_Array_copy(src->data, &dst->data, src->type, elements);
  534. if(retval != UA_STATUSCODE_GOOD) {
  535. UA_Variant_deleteMembers(dst);
  536. UA_Variant_init(dst);
  537. return retval;
  538. }
  539. dst->arrayLength = src->arrayLength;
  540. dst->type = src->type;
  541. dst->storageType = UA_VARIANT_DATA;
  542. if(src->arrayDimensions) {
  543. retval |= UA_Array_copy(src->arrayDimensions, (void **)&dst->arrayDimensions,
  544. &UA_TYPES[UA_TYPES_INT32], src->arrayDimensionsSize);
  545. if(retval != UA_STATUSCODE_GOOD) {
  546. UA_Variant_deleteMembers(dst);
  547. UA_Variant_init(dst);
  548. return retval;
  549. }
  550. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  551. }
  552. return retval;
  553. }
  554. UA_Boolean UA_Variant_isScalar(const UA_Variant *v) {
  555. return (v->data != UA_NULL && v->arrayLength == -1);
  556. }
  557. /**
  558. * Tests if a range is compatible with a variant. If yes, the following values are set:
  559. * - total: how many elements are indicated by the range
  560. * - block_size: how big is each contiguous block of elements in the variant denoted by the range
  561. * - block_distance: how many elements are between the blocks (beginning to beginning)
  562. * - first_elem: where does the first block begin
  563. */
  564. static UA_StatusCode
  565. testRangeWithVariant(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  566. size_t *block_size, size_t *block_distance, size_t *first_elem)
  567. {
  568. /* Test the integrity of the source variant dimensions */
  569. UA_Int32 dims_count = 1;
  570. const UA_Int32 *dims = &v->arrayLength; // default: the array has only one dimension
  571. if(v->arrayDimensionsSize > 0) {
  572. dims_count = v->arrayDimensionsSize;
  573. dims = v->arrayDimensions;
  574. UA_Int32 elements = 1;
  575. for(UA_Int32 i = 0; i < dims_count; i++)
  576. elements *= dims[i];
  577. if(elements != v->arrayLength)
  578. return UA_STATUSCODE_BADINTERNALERROR;
  579. }
  580. /* Test the integrity of the range */
  581. size_t count = 1;
  582. if(range.dimensionsSize != dims_count)
  583. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  584. for(UA_Int32 i = 0; i < dims_count; i++) {
  585. if(range.dimensions[i].min > range.dimensions[i].max)
  586. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  587. if(range.dimensions[i].max > (UA_UInt32)*(dims+i))
  588. return UA_STATUSCODE_BADINDEXRANGENODATA;
  589. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  590. }
  591. /* Compute the block size and the position of the first element */
  592. size_t bs = 0;
  593. size_t bd = 0;
  594. size_t fe = 0;
  595. size_t running_dimssize = 1; // elements per block of dimensions k to k_max
  596. UA_Boolean found_contiguous = UA_FALSE;
  597. for(UA_Int32 k = dims_count - 1; k >= 0; k--) {
  598. if(!found_contiguous && (range.dimensions[k].min != 0 ||
  599. range.dimensions[k].max + 1 != (UA_UInt32)dims[k])) {
  600. found_contiguous = UA_TRUE;
  601. bs = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  602. bd = dims[k] * running_dimssize;
  603. }
  604. fe += running_dimssize * range.dimensions[k].min;
  605. running_dimssize *= dims[k];
  606. }
  607. *total = count;
  608. *block_size = bs;
  609. *block_distance = bd;
  610. *first_elem = fe;
  611. return UA_STATUSCODE_GOOD;
  612. }
  613. UA_StatusCode UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  614. size_t count, block_size, block_distance, first_elem;
  615. UA_StatusCode retval = testRangeWithVariant(src, range, &count, &block_size, &block_distance, &first_elem);
  616. if(retval != UA_STATUSCODE_GOOD)
  617. return retval;
  618. UA_Variant_init(dst);
  619. size_t elem_size = src->type->memSize;
  620. dst->data = UA_malloc(elem_size * count);
  621. if(!dst->data)
  622. return UA_STATUSCODE_BADOUTOFMEMORY;
  623. /* Copy the range */
  624. size_t block_count = count / block_size;
  625. uintptr_t nextdst = (uintptr_t)dst->data;
  626. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first_elem);
  627. if(src->type->fixedSize) {
  628. for(size_t i = 0; i < block_count; i++) {
  629. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  630. nextdst += block_size * elem_size;
  631. nextsrc += block_distance * elem_size;
  632. }
  633. } else {
  634. for(size_t i = 0; i < block_count; i++) {
  635. for(size_t j = 0; j < block_size && retval == UA_STATUSCODE_GOOD; j++) {
  636. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  637. nextdst += elem_size;
  638. nextsrc += elem_size;
  639. }
  640. nextsrc += (block_distance - block_size) * elem_size;
  641. }
  642. if(retval != UA_STATUSCODE_GOOD) {
  643. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  644. UA_Array_delete(dst->data, src->type, copied);
  645. return retval;
  646. }
  647. }
  648. /* Copy the range dimensions*/
  649. if(src->arrayDimensionsSize > 0) {
  650. dst->arrayDimensions = UA_malloc(sizeof(UA_Int32) * src->arrayDimensionsSize);
  651. if(!dst->arrayDimensions) {
  652. UA_Array_delete(dst->data, src->type, count);
  653. return UA_STATUSCODE_BADOUTOFMEMORY;
  654. }
  655. for(UA_Int32 k = 0; k < src->arrayDimensionsSize; k++)
  656. dst->arrayDimensions[k] = range.dimensions[k].max - range.dimensions[k].min + 1;
  657. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  658. }
  659. dst->arrayLength = count;
  660. dst->type = src->type;
  661. return UA_STATUSCODE_GOOD;
  662. }
  663. UA_StatusCode UA_Variant_setRange(UA_Variant *v, void *dataArray, UA_Int32 dataArraySize,
  664. const UA_NumericRange range) {
  665. size_t count, block_size, block_distance, first_elem;
  666. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  667. if(retval != UA_STATUSCODE_GOOD)
  668. return retval;
  669. if((UA_Int32)count != dataArraySize)
  670. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  671. size_t block_count = count / block_size;
  672. size_t elem_size = v->type->memSize;
  673. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  674. uintptr_t nextsrc = (uintptr_t)dataArray;
  675. for(size_t i = 0; i < block_count; i++) {
  676. if(!v->type->fixedSize) {
  677. for(size_t j = 0; j < block_size; j++) {
  678. UA_deleteMembers((void*)nextdst, v->type);
  679. nextdst += elem_size;
  680. }
  681. nextdst -= block_size * elem_size;
  682. }
  683. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  684. nextsrc += block_size * elem_size;
  685. nextdst += block_distance * elem_size;
  686. }
  687. return UA_STATUSCODE_GOOD;
  688. }
  689. UA_StatusCode UA_EXPORT UA_Variant_setRangeCopy(UA_Variant *v, const void *dataArray, UA_Int32 dataArraySize,
  690. const UA_NumericRange range) {
  691. size_t count, block_size, block_distance, first_elem;
  692. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  693. if(retval != UA_STATUSCODE_GOOD)
  694. return retval;
  695. if((UA_Int32)count != dataArraySize)
  696. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  697. size_t block_count = count / block_size;
  698. size_t elem_size = v->type->memSize;
  699. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  700. uintptr_t nextsrc = (uintptr_t)dataArray;
  701. if(v->type->fixedSize) {
  702. for(size_t i = 0; i < block_count; i++) {
  703. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  704. nextsrc += block_size * elem_size;
  705. nextdst += block_distance * elem_size;
  706. }
  707. } else {
  708. for(size_t i = 0; i < block_count; i++) {
  709. for(size_t j = 0; j < block_size; j++) {
  710. UA_deleteMembers((void*)nextdst, v->type);
  711. UA_copy((void*)nextsrc, (void*)nextdst, v->type);
  712. nextdst += elem_size;
  713. nextsrc += elem_size;
  714. }
  715. nextdst += (block_distance - block_size) * elem_size;
  716. }
  717. }
  718. return UA_STATUSCODE_GOOD;
  719. }
  720. UA_StatusCode UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type) {
  721. return UA_Variant_setArray(v, p, -1, type);
  722. }
  723. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  724. void *new = UA_malloc(type->memSize);
  725. if(!new)
  726. return UA_STATUSCODE_BADOUTOFMEMORY;
  727. UA_StatusCode retval = UA_copy(p, new, type);
  728. if(retval != UA_STATUSCODE_GOOD) {
  729. UA_delete(new, type);
  730. return retval;
  731. }
  732. return UA_Variant_setArray(v, new, -1, type);
  733. }
  734. UA_StatusCode UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 elements,
  735. const UA_DataType *type) {
  736. v->type = type;
  737. v->arrayLength = elements;
  738. v->data = array;
  739. return UA_STATUSCODE_GOOD;
  740. }
  741. UA_StatusCode UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 elements,
  742. const UA_DataType *type) {
  743. void *new;
  744. UA_StatusCode retval = UA_Array_copy(array, &new, type, elements);
  745. if(retval != UA_STATUSCODE_GOOD)
  746. return retval;
  747. return UA_Variant_setArray(v, new, elements, type);
  748. }
  749. /* DiagnosticInfo */
  750. UA_TYPE_NEW_DEFAULT(UA_DiagnosticInfo)
  751. UA_TYPE_DELETE_DEFAULT(UA_DiagnosticInfo)
  752. void UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  753. UA_String_deleteMembers(&p->additionalInfo);
  754. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  755. UA_DiagnosticInfo_delete(p->innerDiagnosticInfo);
  756. p->innerDiagnosticInfo = UA_NULL;
  757. }
  758. }
  759. void UA_DiagnosticInfo_init(UA_DiagnosticInfo *p) {
  760. *((UA_Byte*)p) = 0; // zero out the bitfield
  761. p->symbolicId = 0;
  762. p->namespaceUri = 0;
  763. p->localizedText = 0;
  764. p->locale = 0;
  765. UA_String_init(&p->additionalInfo);
  766. p->innerDiagnosticInfo = UA_NULL;
  767. UA_StatusCode_init(&p->innerStatusCode);
  768. }
  769. UA_StatusCode UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst) {
  770. UA_DiagnosticInfo_init(dst);
  771. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  772. dst->symbolicId = src->symbolicId;
  773. dst->namespaceUri = src->namespaceUri;
  774. dst->localizedText = src->localizedText;
  775. dst->locale = src->locale;
  776. dst->innerStatusCode = src->innerStatusCode;
  777. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  778. if(src->hasAdditionalInfo)
  779. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  780. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  781. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  782. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  783. dst->hasInnerDiagnosticInfo = src->hasInnerDiagnosticInfo;
  784. }
  785. else
  786. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  787. }
  788. if(retval) {
  789. UA_DiagnosticInfo_deleteMembers(dst);
  790. UA_DiagnosticInfo_init(dst);
  791. }
  792. return retval;
  793. }
  794. /*******************/
  795. /* Structure Types */
  796. /*******************/
  797. void UA_init(void *p, const UA_DataType *dataType) {
  798. /* Do not check if the index is a builtin-type here. Builtins will be called
  799. with their very own _init functions normally. In the off case, that the
  800. generic function is called with the index of a builtin, their layout
  801. contains a single member of the builtin type, that will be inited in the
  802. for loop. */
  803. uintptr_t ptr = (uintptr_t)p;
  804. UA_Byte membersSize = dataType->membersSize;
  805. for(size_t i=0;i<membersSize; i++) {
  806. const UA_DataTypeMember *member = &dataType->members[i];
  807. if(member->isArray) {
  808. /* Padding contains bit-magic to split into padding before and after
  809. the length integer */
  810. ptr += (member->padding >> 3);
  811. *((UA_Int32*)ptr) = -1;
  812. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  813. *((void**)ptr) = UA_NULL;
  814. ptr += sizeof(void*);
  815. continue;
  816. }
  817. ptr += member->padding;
  818. if(!member->namespaceZero) {
  819. // pointer arithmetic
  820. const UA_DataType *memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  821. UA_init((void*)ptr, memberType);
  822. ptr += memberType->memSize;
  823. continue;
  824. }
  825. switch(member->memberTypeIndex) {
  826. case UA_TYPES_BOOLEAN:
  827. case UA_TYPES_SBYTE:
  828. case UA_TYPES_BYTE:
  829. *(UA_Byte*)ptr = 0;
  830. break;
  831. case UA_TYPES_INT16:
  832. case UA_TYPES_UINT16:
  833. *(UA_Int16*)ptr = 0;
  834. break;
  835. case UA_TYPES_INT32:
  836. case UA_TYPES_UINT32:
  837. case UA_TYPES_STATUSCODE:
  838. case UA_TYPES_FLOAT:
  839. *(UA_Int32*)ptr = 0;
  840. break;
  841. case UA_TYPES_INT64:
  842. case UA_TYPES_UINT64:
  843. case UA_TYPES_DOUBLE:
  844. case UA_TYPES_DATETIME:
  845. *(UA_Int64*)ptr = 0;
  846. break;
  847. case UA_TYPES_GUID:
  848. UA_Guid_init((UA_Guid*)ptr);
  849. break;
  850. case UA_TYPES_NODEID:
  851. UA_NodeId_init((UA_NodeId*)ptr);
  852. break;
  853. case UA_TYPES_EXPANDEDNODEID:
  854. UA_ExpandedNodeId_init((UA_ExpandedNodeId*)ptr);
  855. break;
  856. case UA_TYPES_LOCALIZEDTEXT:
  857. UA_LocalizedText_init((UA_LocalizedText*)ptr);
  858. break;
  859. case UA_TYPES_EXTENSIONOBJECT:
  860. UA_ExtensionObject_init((UA_ExtensionObject*)ptr);
  861. break;
  862. case UA_TYPES_DATAVALUE:
  863. UA_DataValue_init((UA_DataValue*)ptr);
  864. break;
  865. case UA_TYPES_VARIANT:
  866. UA_Variant_init((UA_Variant*)ptr);
  867. break;
  868. case UA_TYPES_DIAGNOSTICINFO:
  869. UA_DiagnosticInfo_init((UA_DiagnosticInfo*)ptr);
  870. break;
  871. default:
  872. // QualifiedName, LocalizedText and strings are treated as structures, also
  873. UA_init((void*)ptr, &UA_TYPES[member->memberTypeIndex]);
  874. }
  875. ptr += UA_TYPES[member->memberTypeIndex].memSize;
  876. }
  877. }
  878. void * UA_new(const UA_DataType *dataType) {
  879. void *p = UA_malloc(dataType->memSize);
  880. if(p)
  881. UA_init(p, dataType);
  882. return p;
  883. }
  884. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *dataType) {
  885. if(dataType->fixedSize) {
  886. memcpy(dst, src, dataType->memSize);
  887. return UA_STATUSCODE_GOOD;
  888. }
  889. UA_init(dst, dataType);
  890. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  891. uintptr_t ptrs = (uintptr_t)src;
  892. uintptr_t ptrd = (uintptr_t)dst;
  893. UA_Byte membersSize = dataType->membersSize;
  894. for(size_t i=0;i<membersSize; i++) {
  895. const UA_DataTypeMember *member = &dataType->members[i];
  896. const UA_DataType *memberType;
  897. if(member->namespaceZero)
  898. memberType = &UA_TYPES[member->memberTypeIndex];
  899. else
  900. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  901. if(member->isArray) {
  902. ptrs += (member->padding >> 3);
  903. ptrd += (member->padding >> 3);
  904. UA_Int32 *dstNoElements = (UA_Int32*)ptrd;
  905. const UA_Int32 elements = *((const UA_Int32*)ptrs);
  906. ptrs += sizeof(UA_Int32) + (member->padding & 0x07);
  907. ptrd += sizeof(UA_Int32) + (member->padding & 0x07);
  908. retval = UA_Array_copy(*(void* const*)ptrs, (void**)ptrd, memberType, elements);
  909. if(retval != UA_STATUSCODE_GOOD) {
  910. UA_deleteMembers(dst, dataType);
  911. UA_init(dst, dataType);
  912. return retval;
  913. }
  914. *dstNoElements = elements;
  915. ptrs += sizeof(void*);
  916. ptrd += sizeof(void*);
  917. continue;
  918. }
  919. ptrs += member->padding;
  920. ptrd += member->padding;
  921. if(!member->namespaceZero) {
  922. retval = UA_copy((const void*)ptrs, (void*)ptrd, memberType);
  923. if(retval != UA_STATUSCODE_GOOD) {
  924. UA_deleteMembers(dst, dataType);
  925. UA_init(dst, dataType);
  926. return retval;
  927. }
  928. ptrs += memberType->memSize;
  929. ptrd += memberType->memSize;
  930. continue;
  931. }
  932. switch(member->memberTypeIndex) {
  933. case UA_TYPES_BOOLEAN:
  934. case UA_TYPES_SBYTE:
  935. case UA_TYPES_BYTE:
  936. *((UA_Byte*)ptrd) = *((const UA_Byte*)ptrs);
  937. break;
  938. case UA_TYPES_INT16:
  939. case UA_TYPES_UINT16:
  940. *((UA_Int16*)ptrd) = *((const UA_Byte*)ptrs);
  941. break;
  942. case UA_TYPES_INT32:
  943. case UA_TYPES_UINT32:
  944. case UA_TYPES_STATUSCODE:
  945. case UA_TYPES_FLOAT:
  946. *((UA_Int32*)ptrd) = *((const UA_Int32*)ptrs);
  947. break;
  948. case UA_TYPES_INT64:
  949. case UA_TYPES_UINT64:
  950. case UA_TYPES_DOUBLE:
  951. case UA_TYPES_DATETIME:
  952. *((UA_Int64*)ptrd) = *((const UA_Int64*)ptrs);
  953. break;
  954. case UA_TYPES_GUID:
  955. *((UA_Guid*)ptrd) = *((const UA_Guid*)ptrs);
  956. break;
  957. case UA_TYPES_NODEID:
  958. retval |= UA_NodeId_copy((const UA_NodeId*)ptrs, (UA_NodeId*)ptrd);
  959. break;
  960. case UA_TYPES_EXPANDEDNODEID:
  961. retval |= UA_ExpandedNodeId_copy((const UA_ExpandedNodeId*)ptrs, (UA_ExpandedNodeId*)ptrd);
  962. break;
  963. case UA_TYPES_LOCALIZEDTEXT:
  964. retval |= UA_LocalizedText_copy((const UA_LocalizedText*)ptrs, (UA_LocalizedText*)ptrd);
  965. break;
  966. case UA_TYPES_EXTENSIONOBJECT:
  967. retval |= UA_ExtensionObject_copy((const UA_ExtensionObject*)ptrs, (UA_ExtensionObject*)ptrd);
  968. break;
  969. case UA_TYPES_DATAVALUE:
  970. retval |= UA_DataValue_copy((const UA_DataValue*)ptrs, (UA_DataValue*)ptrd);
  971. break;
  972. case UA_TYPES_VARIANT:
  973. retval |= UA_Variant_copy((const UA_Variant*)ptrs, (UA_Variant*)ptrd);
  974. break;
  975. case UA_TYPES_DIAGNOSTICINFO:
  976. retval |= UA_DiagnosticInfo_copy((const UA_DiagnosticInfo*)ptrs, (UA_DiagnosticInfo*)ptrd);
  977. break;
  978. default:
  979. // QualifiedName, LocalizedText and strings are treated as structures, also
  980. retval |= UA_copy((const void *)ptrs, (void*)ptrd, memberType);
  981. }
  982. ptrs += memberType->memSize;
  983. ptrd += memberType->memSize;
  984. }
  985. if(retval != UA_STATUSCODE_GOOD) {
  986. UA_deleteMembers(dst, dataType);
  987. UA_init(dst, dataType);
  988. }
  989. return retval;
  990. }
  991. void UA_deleteMembers(void *p, const UA_DataType *dataType) {
  992. UA_deleteMembersUntil(p, dataType, -1);
  993. }
  994. void UA_deleteMembersUntil(void *p, const UA_DataType *dataType, UA_Int32 lastMember) {
  995. uintptr_t ptr = (uintptr_t)p;
  996. if(dataType->fixedSize)
  997. return;
  998. UA_Byte membersSize = dataType->membersSize;
  999. for(size_t i=0;i<membersSize; i++) {
  1000. if(lastMember > -1 && (UA_Int32)i > lastMember){
  1001. return;
  1002. }
  1003. const UA_DataTypeMember *member = &dataType->members[i];
  1004. const UA_DataType *memberType;
  1005. if(member->namespaceZero)
  1006. memberType = &UA_TYPES[member->memberTypeIndex];
  1007. else
  1008. memberType = &dataType[member->memberTypeIndex - dataType->typeIndex];
  1009. if(member->isArray) {
  1010. ptr += (member->padding >> 3);
  1011. UA_Int32 elements = *((UA_Int32*)ptr);
  1012. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  1013. UA_Array_delete(*(void**)ptr, memberType, elements);
  1014. *(void**)ptr = UA_NULL;
  1015. ptr += sizeof(void*);
  1016. continue;
  1017. }
  1018. ptr += member->padding;
  1019. if(!member->namespaceZero) {
  1020. UA_deleteMembers((void*)ptr, memberType);
  1021. ptr += memberType->memSize;
  1022. continue;
  1023. }
  1024. switch(member->memberTypeIndex) {
  1025. case UA_TYPES_BOOLEAN:
  1026. case UA_TYPES_SBYTE:
  1027. case UA_TYPES_BYTE:
  1028. case UA_TYPES_INT16:
  1029. case UA_TYPES_UINT16:
  1030. case UA_TYPES_INT32:
  1031. case UA_TYPES_UINT32:
  1032. case UA_TYPES_STATUSCODE:
  1033. case UA_TYPES_FLOAT:
  1034. case UA_TYPES_INT64:
  1035. case UA_TYPES_UINT64:
  1036. case UA_TYPES_DOUBLE:
  1037. case UA_TYPES_DATETIME:
  1038. case UA_TYPES_GUID:
  1039. break;
  1040. case UA_TYPES_NODEID:
  1041. UA_NodeId_deleteMembers((UA_NodeId*)ptr);
  1042. break;
  1043. case UA_TYPES_EXPANDEDNODEID:
  1044. UA_ExpandedNodeId_deleteMembers((UA_ExpandedNodeId*)ptr);
  1045. break;
  1046. case UA_TYPES_LOCALIZEDTEXT:
  1047. UA_LocalizedText_deleteMembers((UA_LocalizedText*)ptr);
  1048. break;
  1049. case UA_TYPES_EXTENSIONOBJECT:
  1050. UA_ExtensionObject_deleteMembers((UA_ExtensionObject*)ptr);
  1051. break;
  1052. case UA_TYPES_DATAVALUE:
  1053. UA_DataValue_deleteMembers((UA_DataValue*)ptr);
  1054. break;
  1055. case UA_TYPES_VARIANT:
  1056. UA_Variant_deleteMembers((UA_Variant*)ptr);
  1057. break;
  1058. case UA_TYPES_DIAGNOSTICINFO:
  1059. UA_DiagnosticInfo_deleteMembers((UA_DiagnosticInfo*)ptr);
  1060. break;
  1061. default:
  1062. // QualifiedName, LocalizedText and strings are treated as structures, also
  1063. if(lastMember > -1){
  1064. UA_deleteMembersUntil((void*)ptr, memberType, lastMember-i);
  1065. }
  1066. else
  1067. UA_deleteMembers((void*)ptr, memberType);
  1068. }
  1069. ptr += memberType->memSize;
  1070. }
  1071. }
  1072. void UA_delete(void *p, const UA_DataType *dataType) {
  1073. UA_deleteMembers(p, dataType);
  1074. UA_free(p);
  1075. }
  1076. /******************/
  1077. /* Array Handling */
  1078. /******************/
  1079. void* UA_Array_new(const UA_DataType *dataType, UA_Int32 elements) {
  1080. if((UA_Int32)dataType->memSize * elements < 0 || dataType->memSize * elements > MAX_ARRAY_SIZE )
  1081. return UA_NULL;
  1082. if(dataType->fixedSize)
  1083. return UA_calloc(elements, dataType->memSize);
  1084. void *p = UA_malloc(dataType->memSize * (size_t)elements);
  1085. if(!p)
  1086. return p;
  1087. uintptr_t ptr = (uintptr_t)p;
  1088. for(int i = 0; i<elements; i++) {
  1089. UA_init((void*)ptr, dataType);
  1090. ptr += dataType->memSize;
  1091. }
  1092. return p;
  1093. }
  1094. UA_StatusCode UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 elements) {
  1095. if(elements <= 0) {
  1096. *dst = UA_NULL;
  1097. return UA_STATUSCODE_GOOD;
  1098. }
  1099. if(!(*dst = UA_malloc((size_t)elements * dataType->memSize)))
  1100. return UA_STATUSCODE_BADOUTOFMEMORY;
  1101. if(dataType->fixedSize) {
  1102. memcpy(*dst, src, dataType->memSize * (size_t)elements);
  1103. return UA_STATUSCODE_GOOD;
  1104. }
  1105. uintptr_t ptrs = (uintptr_t)src;
  1106. uintptr_t ptrd = (uintptr_t)*dst;
  1107. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1108. for(int i = 0; i < elements; i++) {
  1109. retval |= UA_copy((void*)ptrs, (void*)ptrd, dataType);
  1110. ptrs += dataType->memSize;
  1111. ptrd += dataType->memSize;
  1112. }
  1113. if(retval != UA_STATUSCODE_GOOD)
  1114. UA_Array_delete(*dst, dataType, elements);
  1115. return retval;
  1116. }
  1117. void UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 elements) {
  1118. if(!dataType->fixedSize) {
  1119. uintptr_t ptr = (uintptr_t)p;
  1120. for(UA_Int32 i = 0; i < elements; i++) {
  1121. UA_deleteMembers((void*)ptr, dataType);
  1122. ptr += dataType->memSize;
  1123. }
  1124. }
  1125. UA_free(p);
  1126. }