ua_types.c 41 KB

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